A Multi-objective Ant Colony Optimisation-based Routing Approach for Wireless Sensor Networks Incorporating Trust

نویسنده

  • Ansgar Kellner
چکیده

In the near future, Wireless Sensor Networks (WSNs) are expected to play an important role for sensing applications, in the civilian as well as in the military sector. WSNs are autonomous, distributed, self-organised networks consisting of multiple sensor nodes. Usually, the limited radio range of the nodes, arising from energy constrains, is overcome by the cooperation of nodes. As the Combinatorial Optimisation Problem (COP) of routing is computationally hard, often approximation algorithms are preferred, which are capable of finding near optimal solutions within polynomial time. A simple but robust way of solving the routing COP is the application of Ant Colony Optimisation (ACO)-based routing algorithms. When multiple (conflicting) objectives should be considered, ACO algorithms can be extended to Multi-objective Ant Colony Optimisation (MOACO) algorithms that are capable of considering multiple objectives at the same time within the optimisation process. Normally, the routing in WSNs is susceptible to adversaries due to their deployment in unattended or in hostile environments. Particularly, attacks from compromised nodes (insider attacks) are a severe problem in WSNs. As insider attacks cannot be alleviated by classical security measures, often soft security measures (trust and reputation) are applied to mitigate the impact of these attacks. In this thesis, the idea of using trust as security measure against insider attacks is seized and interweaved with an MOACO-based routing approach. The Multi-objective Ant Colony Optimisation Routing Framework for WSNs (MARFWSN) is developed, a routing framework for WSNs that provides an interface for the docking of MOACObased algorithms that can be used for the routing. Different MOACO-based algorithms – including ASMOACO, MMASMOACO, ACSMOACO and SRMOACO – are implemented and tested, considering multiple objectives incorporating trust. In the first step, several pre-experiments are conducted to find the best input parameters for the MOACO-based WSN routing algorithms. Subsequently, further experiments aim for comparing the MOACO-based routing algorithms to the well-known Dynamic Source Routing (DSR) protocol regarding several performance criteria. Different topologies and traffic patterns are taken into account to obtain heterogeneous results, depending on the specific application area of the tested routing algorithms. The simulation results show that the MOACO-based routing algorithms perform similarly compared to the DSR-based protocol, implicating the possibility for their utilisation in WSNs. The additional benefit of the mitigation of insider attacks for the MOACO-based algorithms, though result in a slightly higher routing overhead and end-to-end delay.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks

High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...

متن کامل

Combining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks

Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...

متن کامل

Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks

Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...

متن کامل

MLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks

Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....

متن کامل

Hybrid Bio-Inspired Clustering Algorithm for Energy Efficient Wireless Sensor Networks

In order to achieve the sensing, communication and processing tasks of Wireless Sensor Networks, an energy-efficient routing protocol is required to manage the dissipated energy of the network and to minimalize the traffic and the overhead during the data transmission stages. Clustering is the most common technique to balance energy consumption amongst all sensor nodes throughout the network. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012